A linear bound for Frobenius powers and an inclusion bound for tight closure
نویسندگان
چکیده
منابع مشابه
A Linear Bound for Frobenius Powers and an Inclusion Bound for Tight Closure
Let I denote an R+-primary homogeneous ideal in a normal standard-graded Cohen-Macaulay domain over a field of positive characteristic p. We give a linear degree bound for the Frobenius powers I [q] of I, q = p, in terms of the minimal slope of the top-dimensional syzygy bundle on the projective variety ProjR. This provides an inclusion bound for tight closure. In the same manner we give a line...
متن کاملA bound for Feichtinger conjecture
In this paper, using the discrete Fourier transform in the finite-dimensional Hilbert space C^n, a class of nonRieszable equal norm tight frames is introduced and using this class, a bound for Fiechtinger Conjecture is presented. By the Fiechtinger Conjecture that has been proved recently, for given A,C>0 there exists a universal constant delta>0 independent of $n$ such that every C-equal...
متن کاملAn upper bound for the regularity of powers of edge ideals
A recent result due to Ha and Van Tuyl proved that the Castelnuovo-Mumford regularity of the quotient ring $R/I(G)$ is at most matching number of $G$, denoted by match$(G)$. In this paper, we provide a generalization of this result for powers of edge ideals. More precisely, we show that for every graph $G$ and every $sgeq 1$, $${rm reg}( R/ I(G)^{s})leq (2s-1) |E(G)|^{s-1} {rm ma...
متن کاملA Tight Bound for EMAC
We prove a new upper bound on the advantage of any adversary for distinguishing the encrypted CBC-MAC (EMAC) based on random permutations from a random function. Our proof uses techniques recently introduced in [BPR05], which again were inspired by [DGH04]. The bound we prove is tight — in the sense that it matches the advantage of known attacks up to a constant factor — for a wide range of the...
متن کاملTight Bound for Matching1
Matching is an extensively studied topic. The question we want to study here is the lower bound of a maximum matching in a graph. Earlier researchers studied the problem of the existence of a perfect matching (i.e. a matching of size n/2 with n vertices in a graph). Petersen [7] showed that a bridgeless cubic graph has a perfect matching. König [4] showed that there exists a perfect matching in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Michigan Mathematical Journal
سال: 2005
ISSN: 0026-2285
DOI: 10.1307/mmj/1133894168